A Repelling–Attracting Metropolis Algorithm for Multimodality
نویسندگان
چکیده
منابع مشابه
A guided walk Metropolis algorithm
The random walk Metropolis algorithm is a simple Markov chain Monte Carlo scheme which is frequently used in Bayesian statistical problems. We propose a guided walk Metropolis algorithm which suppresses some of the random walk behavior in the Markov chain. This alternative algorithm is no harder to implement than the random walk Metropolis algorithm, but empirical studies show that it performs ...
متن کاملA quantum-quantum Metropolis algorithm.
The classical Metropolis sampling method is a cornerstone of many statistical modeling applications that range from physics, chemistry, and biology to economics. This method is particularly suitable for sampling the thermal distributions of classical systems. The challenge of extending this method to the simulation of arbitrary quantum systems is that, in general, eigenstates of quantum Hamilto...
متن کاملAn Adaptive Metropolis algorithm
A proper choice of a proposal distribution for MCMC methods, e.g. for the Metropolis-Hastings algorithm, is well known to be a crucial factor for the convergence of the algorithm. In this paper we introduce an adaptive Metropolis Algorithm (AM), where the Gaussian proposal distribution is updated along the process using the full information cumulated so far. Due to the adaptive nature of the pr...
متن کاملAn adaptive Metropolis algorithm
A proper choice of a proposal distribution for Markov chain Monte Carlo methods, for example for the Metropolis±Hastings algorithm, is well known to be a crucial factor for the convergence of the algorithm. In this paper we introduce an adaptive Metropolis (AM) algorithm, where the Gaussian proposal distribution is updated along the process using the full information cumulated so far. Due to th...
متن کاملMicro-local Analysis for the Metropolis Algorithm
Abstract We prove sharp rates of convergence to stationarity for a simple case of the Metropolis algorithm: the placement of a single disc of radius h randomly into the interval [−1 − h, 1 + h], with h > 0 small. We find good approximations for the top eigenvalues and eigenvectors. The analysis gives rigorous proof for the careful numerical work in ([DN04]). The micro-local techniques employed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2018
ISSN: 1061-8600,1537-2715
DOI: 10.1080/10618600.2017.1415911